Generating Quasigroups for Cryptographic Applications
نویسنده
چکیده
A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary order using the computer algebra system Maple 7 is presented. This problem is crucial to cryptography and its solution permits to implement practical quasigroup-based endomorphic cryptosystems. The order of a quasigroup usually equals the number of characters of the alphabet used for recording both the plaintext and the ciphertext. From the practical viewpoint, the most important quasigroups are of order 256, suitable for a fast software encryption of messages written down in the universal ASCII code. That is exactly what this paper provides: fast and easy ways of generating quasigroups of order up to 256 and a little more.
منابع مشابه
Testing Quasigroup Identities using Product of Sequence
Non-associative quasigroups are well known combinatorial designs with many different applications. Many cryptographic algorithms based on quasigroups primitives have been published. There are several classifications of quasigroups based on their algebraic properties. In this paper we propose a new classification of quasigroups based upon strings (product elements) obtained by a product of a seq...
متن کاملA New Cryptographic Property Based on the Orthogonality of Quasigroups
In order to achieve better cryptographic properties of quasigroups of order 4, we make a new classification. In our research we use an approach with generalized quasigroup orthogonality, which leads us to this interesting classification, on reducible and irreducible quasigroups. Existence of the classes of reducible and irreducible quasigroups depends on the property of orthogonality of quasigr...
متن کاملClassification of Quasigroup-structures with respect to their Cryptographic Properties
Computationally simple but cryptographically strong ciphers play an important role for efficient Computer Security tasks. It is suggested in (Knapskog, 2008) that there is a need for simple cryptographic primitives to implement security in an environment with end users connected with terminals having limited storage and processing power. Constructing ciphers using the algebraic structures of Qu...
متن کاملOn the Randomness and Regularity of Reduced Edon-R Compression Function
EDON-R is one of the candidate hash functions for the ongoing NIST competition for the next cryptographic hash standard called SHA-3. Its construction is based on algebraic properties of non-commutative and non-associative quasigroups of orders 2 and 2. In this paper we are giving some of our results in investigation of the randomness and regularity of reduced EDON-R compression functions over ...
متن کاملUsing Quasigroups for Generating Pseudorandom Numbers
This paper presents an algorithm for generating pseudorandom numbers using quasigroups. Random numbers have several applications in the area of secure communication. The proposed algorithm uses a matrix of size n x n which is pre-generated and stored. The quality of random numbers generated is compared with other pseudorandom number generator using Marsaglia’s Diehard battery of tests.
متن کامل